翻訳と辞書
Words near each other
・ King Abdullah I Mosque
・ King Abdullah II Stadium
・ King Abdullah Petroleum Studies and Research Center
・ King Abdullah Sport City Stadium
・ King Abdullah Sports City
・ King Abdullah University Hospital
・ King Abdullah University of Science and Technology
・ King Adora
・ King Agron
・ King Ahaz's Seal
・ King Ai of Chu
・ Kinetic logic
・ Kinetic Luna
・ Kinetic military action
・ Kinetic minimum box
Kinetic minimum spanning tree
・ Kinetic Monte Carlo
・ Kinetic Monte Carlo surface growth method
・ Kinetic Mountain Goat
・ Kinetic novel
・ Kinetic photography
・ Kinetic Playground
・ Kinetic PreProcessor
・ Kinetic priority queue
・ Kinetic proofreading
・ Kinetic Rain
・ Kinetic Records
・ Kinetic resolution
・ Kinetic Rule Language
・ Kinetic Sand


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Kinetic minimum spanning tree : ウィキペディア英語版
Kinetic minimum spanning tree

A kinetic minimum spanning tree is a kinetic data structure that maintains the minimum spanning tree (MST) of a graph whose edge weights are changing as a continuous function of time.
== General case ==
The most efficient known data structure for the general case uses a kinetic sorted list to store the edge weights, and a standard MST algorithm to compute the MST given the sorted edge weights. This data structure must process O(n^2) events, developing a more efficient data structure remains an open problem.〔

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Kinetic minimum spanning tree」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.